A Quantum Genetic Based Scheduling Algorithm for stochastic flow shop scheduling problem with random breakdown
نویسندگان
چکیده
Abstract: A Quantum Genetic Based Scheduling Algorithm (QGBSA) for stochastic flow shop scheduling with random breakdown and random repair time is proposed in this paper, which combines stochastic programming and stochastic simulation theory, quantum compute and genetic algorithm together. In the QGBSA, the Q-bit based representation in discrete 0-1 hyperspace is employed, which is then converted into decimal scheduling code, and quantum gate is used to update the current generation. Meanwhile, catastrophe operator is added to avoid premature. In order to improve the effectiveness of scheduling scheme, the stochastic programming theory is used to set up a stochastic flow shop scheduling model without breakdown. Then we consider two different working modes—preemptive-resume and preemptiverepeat under breakdown. The former processes the rest part of interrupted job while the later reprocesses the interrupted job. Under each working mode, the situations where breakdown happened at any time or at machine’s life-span time were discussed. Finally, compared with traditional Genetic Algorithm (GA), computational results show the feasibility and effectiveness of QGBSA policy.
منابع مشابه
Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملNew Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملA novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study
Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...
متن کامل